In ibm ' s finite - state machine , a given state may link more than two nodes Ibm的有限狀態(tài)機(jī)里,某狀態(tài)可能與兩個(gè)以上的狀態(tài)相連。
Finite - state machine 有限狀態(tài)機(jī)
In many other finite - state machines , a similar increment would require 100 times more space 其他許多有限狀態(tài)機(jī)在相同狀況下,對(duì)記憶體的需求可能會(huì)增加百倍。
Thus , the grammar behaves like a finite - state machine that moves between states to produce cfrun atoms 因此,文法的行為象在狀態(tài)之間移動(dòng)的有限狀態(tài)機(jī),以產(chǎn)生cfrun原子。
At least in the laboratory , applying a finite - state machine to streaming applications improves performance substantially 把有限狀態(tài)機(jī)運(yùn)用在串流應(yīng)用上可大幅改善效能,至少在實(shí)驗(yàn)室里是如此。
In many finite - state machines , storing rules for carrying out the transitions in a state diagram consumes a large amount of memory 許多有限狀態(tài)機(jī)為了儲(chǔ)存狀態(tài)圖內(nèi)的狀態(tài)轉(zhuǎn)變規(guī)則,都會(huì)消耗大量記憶體。
That is one of the reasons finite - state machines have been deployed for years in graphics processors and voice - recognition systems and in hardware design 多年來(lái),繪圖處理器、聲音辨識(shí)系統(tǒng)與硬體設(shè)計(jì)一直都采用有限狀態(tài)機(jī),這就是原因之一。
Finite - state machines , however , have not lent themselves to being reprogrammed readily , thus sacrificing the flexible , general - purpose quality of the von neumann - based cpu 不過(guò),有限狀態(tài)機(jī)無(wú)法隨時(shí)重新編程,因此缺少馮諾曼架構(gòu)cpu的彈性與通用性。
This course consists of lectures and labs on digital logic , flipflops , pals , counters , timing , synchronization , finite - state machines , and microprogrammed systems 本課包括了數(shù)字邏輯、觸發(fā)器、 pal (可編程邏輯陣列) 、計(jì)數(shù)器、時(shí)序、同步、有限狀態(tài)機(jī)、和微控制系統(tǒng)方面的講課與實(shí)驗(yàn)。
It builds up a feature model to represent the internal states of the feature and its transition with a finite - state machine and to represent the intrinsic properties of the features with temporal logic 能力件模型采用有限狀態(tài)機(jī)和時(shí)序邏輯分別表示能力件的內(nèi)部狀態(tài)及其轉(zhuǎn)移關(guān)系和能力件所具有的不變性。